G . Metcalfe Giles ’ s Game and the Proof Theory of Lukasiewicz Logic
نویسندگان
چکیده
In the 1970s, Robin Giles introduced a game combining Lorenzen-style dialogue rules with a simple scheme for betting on the truth of atomic statements, and showed that the existence of winning strategies for the game corresponds to the validity of formulas in Lukasiewicz logic. In this paper, it is shown that ‘disjunctive strategies’ for Giles’s game, combining ordinary strategies for all instances of the game played on the same formula, may be interpreted as derivations in a corresponding proof system. In particular, such strategies mirror derivations in a hypersequent calculus developed in recent work on the proof theory of Lukasiewicz logic.
منابع مشابه
Bounded Lukasiewicz Logics
In this work we investigate bounded Lukasiewicz logics, characterised as the intersection of the k-valued Lukasiewicz logics for k = 2, . . . , n (n ≥ 2). These logics formalise a generalisation of Ulam’s game with applications in Information Theory. Here we provide an analytic proof calculus G LBn for each bounded Lukasiewicz logic, obtained by adding a single rule to G L, a hypersequent calcu...
متن کاملFrom Games to Truth Functions: A Generalization of Giles's Game
Motivated by aspects of reasoning in theories of physics, Robin Giles defined a characterization of infinite valued Lukasiewicz logic in terms of a game that combines Lorenzen-style dialogue rules for logical connectives with a scheme for betting on results of dispersive experiments for evaluating atomic propositions. We analyze this game and provide conditions on payoff functions that allow us...
متن کاملPreservation theorems in {L}ukasiewicz \model theory
We present some model theoretic results for {L}ukasiewiczpredicate logic by using the methods of continuous model theorydeveloped by Chang and Keisler.We prove compactness theorem with respect to the class of allstructures taking values in the {L}ukasiewicz $texttt{BL}$-algebra.We also prove some appropriate preservation theorems concerning universal and inductive theories.Finally, Skolemizatio...
متن کاملREVISITING GILES’S GAME Reconciling Fuzzy Logic and Supervaluation∗
We explain Giles’s characterization of Lukasiewicz logic via a dialogue game combined with bets on results of experiments that may show dispersion. The game is generalized to other fuzzy logics and linked to recent results in proof theory. We argue that these results allow one to place t-norm based fuzzy logics in a common framework with supervaluation as a theory of vagueness.
متن کاملSequent and Hypersequent Calculi for Abelian and Lukasiewicz Logics
We present two embeddings of in nite-valued Lukasiewicz logic L into Meyer and Slaney’s abelian logic A, the logic of lattice-ordered abelian groups. We give new analytic proof systems for A and use the embeddings to derive corresponding systems for L. These include: hypersequent calculi for A and L and terminating versions of these calculi; labelled single sequent calculi for A and L of comple...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009